Efficient Algorithms for String-Based Negative Selection
نویسندگان
چکیده
String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of S. Then, use these detectors to partition a monitor set M into self and non-self elements. Implementations of this scheme are often impractical because they need exponential time in the size of S to construct D. Here, we consider r-chunk and r-contiguous detectors, two common implementations that suffer from this problem, and show that compressed representations of D are constructible in polynomial time for any given S and r. Since these representations can themselves be used to classify the elements in M , the worst-case running time of r-chunk and r-contiguous detector based negative selection is reduced from exponential to polynomial.
منابع مشابه
BeeID: intrusion detection in AODV-based MANETs using artificial Bee colony and negative selection algorithms
Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...
متن کاملNegative Selection Based Data Classification with Flexible Boundaries
One of the most important artificial immune algorithms is negative selection algorithm, which is an anomaly detection and pattern recognition technique; however, recent research has shown the successful application of this algorithm in data classification. Most of the negative selection methods consider deterministic boundaries to distinguish between self and non-self-spaces. In this paper, two...
متن کاملNegative selection algorithms on strings with efficient training and linear-time classification
A string-based negative selection algorithm is an immune-inspired classifier that infers a bipartitioning of a string space Σ from a training set S containing samples from only one of the partitions. The algorithm generates a set of patterns, called “detectors”, to cover regions of the string space containing none of the training samples. These patterns are then used for classification. A major...
متن کاملA Comparative Study of Negative Selection Based Anomaly Detection in Sequence Data
The negative selection algorithm is one of the oldest immuneinspired classification algorithms and was originally intended for anomaly detection tasks in computer security. After initial enthusiasm, performance problems with the algorithm lead many researchers to conclude that negative selection is not a competitive anomaly detection technique. However, in recent years, theoretical work has lea...
متن کاملOptimizing and Matching Bitstrings
Strings of bits (bitstrings) are a common first-order representation in the design and preliminary investigation of computational intelligence algorithms given (1) the ease in mapping the strings to arbitrary domains (such as real numbers), and (2) in terms of mathematical analysis. This work considers the use of bitstrings in the context of the clonal expansion and antigenic selection in a gen...
متن کاملFast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem has increased dramatically because of the prevalence of the Web. In this paper, we aim to explore the efficient top-k similar string matching problem. Several efficient strategies are introduced, such as length aware a...
متن کامل